Strong Normalization in the π-calculus with Intersection and Union Types
نویسنده
چکیده
We present a typing system for the π-calculus which guarantees that every well-typed term is strongly normalizing. Our typing system is an extension of that presented in Strong normalisation in the π-calculus by Yoshida, Honda and Berger [23] and it is able to type more term than that presented there.
منابع مشابه
Intersection and Union Type Assignment and Polarised λ̄μμ̃
Intersection and union type assignment systems are powerful tools for reasoning programs that completely characterise many semantic properties such as strong normalisation. At the same time, they are known to be subtle, particularly in the presence of computational effect. To address the difficulty, this paper develops an approach based on polarities and refinement intersection type systems. We...
متن کاملEncoding CDuce in the Cπ-calculus?
CDuce is a functional programming language featuring overloaded functions and a rich type system with recursive types, subtyping, union, negation and intersection types. The boolean constructors have a set-theoretic behaviour defined via a semantic interpretation of the types. The Cπ-calculus is an extension of the π-calculus that enriches Pierce and Sangiorgi π-calculus subtyping with union, i...
متن کاملEncoding CDuce in the Cpi-Calculus
We present a type faithful encoding of CDuce into the Cπ-calculus. These calculi are two variants of, respectively, the λ-calculus and the π-calculus, characterised by rich typing and subtyping systems with union, negation, and intersection types. The encoding is interesting because it sheds new light on the Milner-Turner encoding, on the relations between sequential and remote execution of fun...
متن کاملA Translation of Intersection and Union Types for the λμ-Calculus
We introduce an intersection and union type system for the λμ-calculus, which includes a restricted version of the traditional unionelimination rule. We give a translation from intersection and union types into intersection and product types, which is a variant of negative translation from classical logic to intuitionistic logic and naturally reflects the structure of strict intersection and un...
متن کاملAn elementary proof of strong normalization for intersection types
We provide a new and elementary proof of strong normalization for the lambda calculus of intersection types. It uses no strong method, like for instance Tait-Girard reducibility predicates, but just simple induction on type complexity and derivation length and thus it is obviously formalizable within first order arithmetic. To obtain this result, we introduce a new system for intersection types...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 121 شماره
صفحات -
تاریخ انتشار 2012